package ink.lovejinhu.leetcode;

/**
 * @author jinhu
 * created 2021-08-02 19:05
 */
public class Solution_0705 {


    /**
     * Initialize your data structure here.
     */
    public Solution_0705() {

    }

    boolean[] nodes = new boolean[1000009];

    public void add(int key) {
        nodes[key] = true;
    }

    public void remove(int key) {
        nodes[key] = false;
    }

    public boolean contains(int key) {
        return nodes[key];
    }


}
